|
In mathematics, the Hardy–Ramanujan theorem, proved by , states that the normal order of the number ω(''n'') of distinct prime factors of a number ''n'' is log(log(''n'')). Roughly speaking, this means that most numbers have about this number of distinct prime factors. ==Precise statement== A more precise version states that for any real-valued function ψ(''n'') that tends to infinity as ''n'' tends to infinity : or more traditionally : for ''almost all'' (all but an infinitesimal proportion of) integers. That is, let ''g''(''x'') be the number of positive integers ''n'' less than ''x'' for which the above inequality fails: then ''g''(''x'')/''x'' converges to zero as ''x'' goes to infinity. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Hardy–Ramanujan theorem」の詳細全文を読む スポンサード リンク
|